The Longest Common Parameterized Subsequence Problem
نویسنده
چکیده
In this paper we describe an approach to solve the problem of the longest common parameterized subsequence. This approach is based on constructing logical models for LCPS. Mathematics Subject Classification: 03D15, 68Q17
منابع مشابه
Parameterized Computation of LCS for Two Sequences
The problem of finding the longest common subsequence is a well-known optimization problem because of its applications, especially in bioinformatics. In this paper, by applying the techniques developed in parameterized computation, an efficient approach for the problem of finding the longest common subsequence of two sequences is presented. The parameterized approach is compared with the well-k...
متن کاملAlgorithms for Computing the Longest Parameterized Common Subsequence
In this paper, we revisit the classic and well-studied longest common subsequence (LCS) problem and study some new variants, first introduced and studied by Rahman and Iliopoulos [Algorithms for Computing Variants of the Longest Common Subsequence Problem, ISAAC 2006]. Here we define a generalization of these variants, the longest parameterized common subsequence (LPCS) problem, and show how to...
متن کاملOn the parameterized complexity of the repetition free longest common subsequence problem
Finding the longest subsequence present in two different strings is known as the Longest Common Subsequence (LCS) problem. It has been widely used as a measure to compare strings in different fields [2], in particular for the comparison of two (or more) genomes in Bioinformatics. Genomes are usually viewed as strings, where each symbol represents a gene, and the comparison of the strings associ...
متن کاملOn the Longest Common Parameterized Subsequence
The well-known problem of the longest common subsequence (LCS), of two strings of lengths n and m respectively, is O(nm)-time solvable and is a classical distance measure for strings. Another well-studied string comparison measure is that of parameterized matching, where two equal-length strings are a parameterized-match if there exists a bijection on the alphabets such that one string matches ...
متن کاملVariants of Constrained Longest Common Subsequence
In this work, we consider a variant of the classical Longest Common Subsequence problem called Doubly-Constrained Longest Common Subsequence (DC-LCS). Given two strings s1 and s2 over an alphabet Σ, a set Cs of strings, and a function Co : Σ → N , the DC-LCS problem consists in finding the longest subsequence s of s1 and s2 such that s is a supersequence of all the strings in Cs and such that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012